On the Positive-Negative Partial Set Cover problem
نویسنده
چکیده
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover problem, and it naturally arises in certain data mining applications.
منابع مشابه
Automatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملThe Poset Cover Problem
A partial order or poset , P X on a (finite) base set X determines the set P of linear extensions of P . The problem of computing, for a poset P , the cardinality of P is #P-complete. A set 1 2 , , , k P P P of posets on X covers the set of linear orders that is the union of the i P . Given linear orders 1 2 , , , m L L L on X , the Poset Cover problem is to de...
متن کاملThe Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substructure of resource allocation and scheduling problems with precedence constraints and robust network flow problems under demand/capacity uncertainty. We give a polyhedral analysis of the convex hull of the flow set wi...
متن کاملBeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملOn Partial Covering For Geometric Set Systems
We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X ,S), where X is a set of elements and S is a collection of subsets of X , and an integer k ≤ |X |. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from S. In the geometric version, X typic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 108 شماره
صفحات -
تاریخ انتشار 2008